منابع مشابه
Iterative Compression for Exactly Solving NP-Hard Minimization Problems
We survey the conceptual framework and several applications of the iterative compression technique introduced in 2004 by Reed, Smith, and Vetta. This technique has proven very useful for achieving a number of recent breakthroughs in the development of fixed-parameter algorithms for NP-hard minimization problems. There is a clear potential for further applications as well as a further developmen...
متن کاملNP-hardness of the cluster minimization problem revisited
The computational complexity of the \cluster minimization problem" is revisited [L. T. Wille and J. Vennik, J. Phys. A 18, L419 (1985)]. It is argued that the original NP-hardness proof does not apply to pairwise potentials of physical interest, such as those that depend on the geometric distance between the particles. A geometric analog of the original problem is formulated, and a new proof fo...
متن کاملOne Sided Crossing Minimization Is NP-Hard for Sparse Graphs
The one sided crossing minimization problem consists of placing the vertices of one part of a bipartite graph on prescribed positions on a straight line and finding the positions of the vertices of the second part on a parallel line and drawing the edges as straight lines such that the number of pairwise edge crossings is minimized. This problem represents the basic building block used for draw...
متن کاملSLIGHTLY m - CONTINUOUS MULTIFUNCTIONS
We introduce a new class of multifunctions called a slightly m-continuous multifunction which is a generalization of both slightly continuous functions [10] and m-continuous multifunctions [33]. In this paper we obtain several properties of such a multifunction.
متن کاملContinuity of Multifunctions.
12 Tousey, R., "The solar spectrum in space," Astronautics, 6, 32 (July 1961). 1"Steacie, E. W. R., Atomic and Free Radical Reactions, Am. Chem. Soc. Monograph (New York: Reinhold Publishing Corp., 1954), 2nd ed., vols. 1 and 2. 14 Rubey, W. W., Bull. Geol. Soc. Am., 62, 1111 (1951). 51 Kuiper, G. P., private communication. 16Kuiper, G. P., Comm. Lunar Planetary Lab., University of Arizona, 2, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2004
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(03)00525-5